Sparse Image and Video Recovery Using Gradient Projection for Linearly Constrained Convex Optimization

نویسندگان

  • Daniel Thompson
  • Roummel F. Marcia
  • Arnold D. Kim
  • Boaz Ilan
چکیده

OF THE CAPSTONE PROJECT Sparse Image and Video Recovery Using Gradient Projection for Linearly Constrained Convex Optimization by Daniel Thompson May 2011 University of California, Merced Abstract This project concerns the reconstruction of a signal, which corresponds to either an image or a temporally-varying scene. Signal recovery can be accomplished through finding a sparse solution to an `2-`1 minimization problem, which can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel intensities. Hence, additional nonnegativity constraints are placed upon the `2-`1 minimization problem. This results in a more difficult problem to solve, but one with a higher potential for accurate reconstructions. This work focuses on a gradient projection approach for sparse signal recovery that incorporates nonnegativity constraints in the minimization problem. For video recovery we exploit inter-frame correlations to improve upon the näıve approach of solving each frame independently. Numerical results are presented for both an image and video experiment to demonstrate the effectiveness of this approach.This project concerns the reconstruction of a signal, which corresponds to either an image or a temporally-varying scene. Signal recovery can be accomplished through finding a sparse solution to an `2-`1 minimization problem, which can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel intensities. Hence, additional nonnegativity constraints are placed upon the `2-`1 minimization problem. This results in a more difficult problem to solve, but one with a higher potential for accurate reconstructions. This work focuses on a gradient projection approach for sparse signal recovery that incorporates nonnegativity constraints in the minimization problem. For video recovery we exploit inter-frame correlations to improve upon the näıve approach of solving each frame independently. Numerical results are presented for both an image and video experiment to demonstrate the effectiveness of this approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex feasibility modeling and projection methods for sparse signal recovery

A computationally-efficient method for recovering sparse signals from a series of noisy observations, known as the problem of compressed sensing (CS), is presented. The theory of CS usually leads to a constrained convex minimization problem. In this work, an alternative outlook is proposed. Instead of solving the CS problem as an optimization problem, it is suggested to transform the optimizati...

متن کامل

A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization

This paper presents a new dual formulation for quadratically constrained convex programs (QCCP). The special structure of the derived dual problem allows to apply the gradient projection algorithm to produce a simple explicit method involving only elementary vector-matrix operations, that is proven to converge at a linear rate.

متن کامل

Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization

We provide stronger and more general primal-dual convergence results for FrankWolfe-type algorithms (a.k.a. conditional gradient) for constrained convex optimization, enabled by a simple framework of duality gap certificates. Our analysis also holds if the linear subproblems are only solved approximately (as well as if the gradients are inexact), and is proven to be worst-case optimal in the sp...

متن کامل

A Nonnegatively Constrained Convex Programming Method for Image Reconstruction

We consider a large-scale convex minimization problem with nonnegativity constraints that arises in astronomical imaging. We develop a cost functional which incorporates the statistics of the noise in the image data and Tikhonov regularization to induce stability. We introduce an efficient hybrid gradient projection-reduced Newton (active set) method. By “reduced Newton” we mean taking Newton s...

متن کامل

Fast alternating projection methods for constrained tomographic reconstruction

The alternating projection algorithms are easy to implement and effective for large-scale complex optimization problems, such as constrained reconstruction of X-ray computed tomography (CT). A typical method is to use projection onto convex sets (POCS) for data fidelity, nonnegative constraints combined with total variation (TV) minimization (so called TV-POCS) for sparse-view CT reconstruction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012